The Single (and Multi) Item profit maximizing capacitated lot-size (PCLSP) problem with fixed prices and no set-up

Lot-size problems has drawn a great deal of attention in OR/Operations Management research literature. In their purest form, lot-size problems focus on the trade-off between set-up and inventory costs in generalized production environments. Single item lot-size problems are successfully treated through specialized Dynamic Programming algorithms [10, 12], while multi item problems prove harder to solve. Many authors have proposed various algorithmic approaches in order to handle the NP-hardness of these problems – see e. g. [3]. Recently, several authors have analyzed extensions to classical lot-sizing through pricing. Examples of this line of research may be found in [5, 6] and [8]